Translating Aggregate Queries into Iterative Programs
نویسندگان
چکیده
Over the last decade, many techniques for optimizing relational queries have been developed. However, the optimization of queries with aggregation has received little attention. This paper investigates possible improvements for aggregate queries on groups of tuples. We suggest the use of program transformation methods to systematically generate efficient iterative programs for their evaluation. Two transformation steps successively translate a program, which sorts the relation before applying the aggregate function, into an iterative program which performs the aggregation while sorting, thus using less time and space than needed for the execution of the initial program.
منابع مشابه
Translating and Optimizing SQL Queries Having Aggregates
is at least ae powerful as SQL. Two well known relational query languages that have a sound theoretical foundation are relational algebra and relational calculus. As SQL is more closely related to relational calculus, we define the semantics of SQL by translation into calculus. However, relational calculus has to be extended in order to deal with aggregate functions and null values. The op timi...
متن کاملارائه روشی پویا جهت پاسخ به پرسوجوهای پیوسته تجمّعی اقتضایی
Data Streams are infinite, fast, time-stamp data elements which are received explosively. Generally, these elements need to be processed in an online, real-time way. So, algorithms to process data streams and answer queries on these streams are mostly one-pass. The execution of such algorithms has some challenges such as memory limitation, scheduling, and accuracy of answers. They will be more ...
متن کاملSynthesizing Least Fixed Point Queries Into Non-Recursive Iterative Programs
An algorithm is presented which takes a least fixed point query expressed by a basis and inductive step and transforms it into a non-recursive iterative program. By augmenting a relational system with this algorithm, least fixed point queries can be handled automatically, and there is no need to proceduralizc relational algebra for such queries.
متن کاملEecient Incremental Evaluation of Queries with Aggregation
We present a technique for eeciently evaluating queries on programs with mono-tonic aggregation, a class of programs deened by Ross and Sagiv. Our technique consists of the following components: incremental computation of aggregate functions , incremental xpoint evaluation of monotonic programs and Magic Sets transformation of monotonic programs. We also present a formalization of the notion of...
متن کاملEfficient Incremental Evaluation of Queries with Aggregation
We present a technique for eeciently evaluating queries on programs with mono-tonic aggregation, a class of programs deened by Ross and Sagiv. Our technique consists of the following components: incremental computation of aggregate functions , incremental xpoint evaluation of monotonic programs and Magic Sets transformation of monotonic programs. We also present a formalization of the notion of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1986